Selecting action slates using reinforcement learning

ABSTRACT

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for selecting action slates using reinforcement learning. One of the methods includes receiving an observation characterizing a current state of an environment; selecting an action slate by processing the observation and a plurality of candidate action slates using a deep neural network, wherein each candidate action slate comprises a respective plurality of actions from the set of actions, and wherein the deep neural network is configured to, for each of the candidate action slates, process the observation and the actions in the candidate action slate to generate a slate Q value for the candidate action slate that is an estimate of a long-term reward resulting from the candidate action slate being provided to the action selector in response to the observation; and providing the selected action slate to an action selector in response to the observation.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to U.S. Provisional Application No. 62/261,781, filed on Dec. 1, 2015. The disclosure of the prior application is considered part of and is incorporated by reference in the disclosure of this application.

BACKGROUND

This specification relates to reinforcement learning.

In a reinforcement learning system, an agent interacts with an environment by performing actions that are selected by the reinforcement learning system in response to receiving observations that characterize the current state of the environment.

Some reinforcement learning systems select the action to be performed by the agent in response to receiving a given observation in accordance with an output of a neural network.

Neural networks are machine learning models that employ one or more layers of nonlinear units to predict an output for a received input. Some neural networks are deep neural networks that include one or more hidden layers in addition to an output layer. The output of each hidden layer is used as input to the next layer in the network, i.e., the next hidden layer or the output layer. Each layer of the network generates an output from a received input in accordance with current values of a respective set of parameters.

SUMMARY

This specification describes technologies that relate to reinforcement learning. In particular, this specification describes techniques for selecting an action slate that includes multiple actions in response to an observation characterizing a state of an environment. An action selector then interacts with the environment by selecting an action, e.g., by selecting an action from the provided action slate.

For a system of one or more computers to be configured to perform particular operations or actions means that the system has installed on it software, firmware, hardware, or a combination of them that in operation cause the system to perform the operations or actions. For one or more computer programs to be configured to perform particular operations or actions means that the one or more programs include instructions that, when executed by data processing apparatus, cause the apparatus to perform the operations or actions.

The subject matter described in this specification can be implemented in particular embodiments so as to realize one or more of the following advantages. A reinforcement learning system can effectively provide slates of actions to an action selector, even when the action that is selected from the slate is not under the control of the reinforcement learning system and even when the action selector can select actions that are not in the provided action slate, i.e. a null action. The reinforcement learning system selects action slates in a manner that optimizes for both the combinatorial and sequential aspects of the action slate selection task, allowing the reinforcement learning system to effectively select action slates even when the space of possible actions is very large. Additionally, the reinforcement learning system can effectively select action slates from high-dimensional observations characterizing the environment.

The details of one or more embodiments of the subject matter of this specification are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the subject matter will become apparent from the description, the drawings, and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example reinforcement learning system.

FIG. 2 is a flow diagram of an example process for selecting an action slate in response to the observation.

FIG. 3 is a flow diagram of an example process for selecting actions for a given subset of an action slate.

Like reference numbers and designations in the various drawings indicate like elements.

DETAILED DESCRIPTION

This specification generally describes a reinforcement learning system that selects a slate of actions in response to an observation that characterize the state of an environment and provides the selected action slate to an action selector.

Each slate of actions includes multiple actions from a predetermined set of actions and the action selector interacts with the environment by selecting and performing an action. In some implementations, in response to receiving a given action slate, the action selector selects and performs either (i) an action selected from the action slate or (ii) a null action that is not included in the set of actions.

The environment generally transitions or changes states in response to actions performed by the action selector. In particular, in response to the action selector performing an action, the environment transitions into a new state and the reinforcement learning system receives a reward. The reward is a numeric value that is a function of the state of the environment. While interacting with the environment, the reinforcement learning system attempts to maximize the long-term reward received in response to the actions performed by the action selector.

In some implementations, the environment is a content item presentation setting provided by a content item recommendation system and the action selector is a user of the content item recommendation system. In these implementations, the actions in the set of actions are recommendations of content items, with each action in the action slate being a recommendation of a distinct content item to the user of the content item recommendation system. The user selects and performs an action by selecting a recommendation and viewing the corresponding content item, which can trigger additional recommendations to be provided by the content item recommendation system. In these implementations, the null action corresponds to the user choosing not to select any of the provided content item recommendations.

In some other implementations, the environment is a presentation setting for a software product or content item, the actions are possible configurations for the software product or content item, and the action selector is a computer program that measures the effectiveness of each of the configurations in an action slate that is provided to the action selector and then selects and performs the action, i.e., the configuration, that is most effective. If none of the configurations is more effective than the current configuration for the software product or content item, the action selector selects the null action, i.e., does not select any of the possible configurations to replace the current configuration.

In some other implementations, the environment is a real-world environment that is being navigated through by a vehicle and the action selector is an operator of the vehicle or a control system of the vehicle. In these implementations, the actions in the set of actions are possible control inputs for the vehicle, with each action in the action slate being a distinct possible control input for the vehicle. The operator or the control system selects and performs an action by submitting one of the possible control inputs to cause the vehicle to navigate through the environment. In these implementations, the null action corresponds to the control system or the operator choosing not to select any of the possible control inputs.

In some other implementations, the environment is a networked real-world system, e.g., an electric grid or a data center, the actions are possible settings for the networked real-world system that affect the energy efficiency or performance of the networked system, and the action selector is a control system that selects actions based on different criteria, e.g., safety, or a user that manages the settings for the networked system.

FIG. 1 shows an example reinforcement learning system 100. The reinforcement learning system 100 is an example of a system implemented as computer programs on one or more computers in one or more locations in which the systems, components, and techniques described below are implemented.

The reinforcement learning system 100 receives observations characterizing states of an environment 102 and, in response to each observation, selects an action slate to be provided to an action selector 104 that selects and performs actions to interact with the environment 102. Each action slate includes multiple actions selected from a predetermined set of possible actions.

In particular, the reinforcement learning system 100 receives an observation characterizing a current state of the environment 102, selects an action slate that includes multiple actions, and provides the selected action slate to the action selector 104.

Generally, the observation is data characterizing the current state of the environment.

For example, in cases where the environment 102 is a content item presentation setting, the observation may be a high-dimensional feature vector that characterizes the current content item presentation setting.

As another example, in cases where the environment 102 is a real-world environment, the observation may include an image of the real-world environment and/or other data captured by other sensors of the vehicle navigating through the real-world environment.

In some implementations, the observation also includes data characterizing a preceding action that was selected by the action selector 104 in response to being provided a preceding slate of actions, i.e., the slate of actions provided to the action selector 104 in response to a preceding observation. For example, the data characterizing the preceding action can be an identifier of the preceding action or a feature vector characterizing properties of the preceding action.

The reinforcement learning system 100 selects the action slate by processing the observation and multiple candidate action slates using a slate Q network 110. The slate Q network 110 is a deep neural network that is configured to, for each of the candidate action slates, process the observation and the actions in the candidate action slate to generate a slate Q value for the candidate action slate that is an estimate of a long-term reward resulting from the candidate action slate being provided to the action selector 104 in response to the observation. The long-term reward can be, for example, the time-discounted sum of future rewards received by the reinforcement learning system 100 after the observation characterizing the current state of the environment 102 is received. Depending on the implementation, the slate Q network 110 can be either a recurrent neural network or a feedforward neural network.

Selecting an action slate using the slate Q network 110 in response to an observation is described in more detail below with reference to FIGS. 2 and 3.

In order to allow the reinforcement learning system 100 to effectively select action slates to be provided to the action selector 104, the reinforcement learning system 100 includes a training engine 150 that trains the slate Q network 110 to adjust the values of the parameters of the slate Q network from initial values of the parameters.

In particular, during the training, the training engine 150 receives, in response to providing an action slate to the action selector 104, a reward and uses the reward in updating values of the parameters of the slate Q network 110. For example, the training engine 150 can receive the reward and a new observation characterizing the state that the environment 102 transitioned into as a result of the action selector 104 selecting and performing an action, e.g., an action from the provided action slate or a null action, and uses the current observation, the action slate provided to the action selector 104 in response to the current observation, the reward, and the next observation to adjust the values of the parameters of the slate Q network 110 using a conventional reinforcement learning technique, e.g., a variant of a deep Q learning or SARSA technique.

In some implementations, the training engine 150 modifies the rewards that are being used to train the slate Q network 110. In particular, in some implementations, during the training, the training engine 150 modifies each received reward to generate a modified reward and uses the modified reward in place of the received reward in adjusting the values of the parameters of the slate Q network 110. In some of these implementations, the training engine 150 replaces a received reward r with a modified reward r{circumflex over ( )}a, where a is a predetermined constant value that is greater than one. For example, a can be a value between 1.25 and 2.5.

FIG. 2 is a flow diagram of an example process 200 for selecting an action slate in response to a received observation. For convenience, the process 200 will be described as being performed by a system of one or more computers located in one or more locations. For example, a reinforcement learning system, e.g., the reinforcement learning system 100 of FIG. 1, appropriately programmed in accordance with this specification, can perform the process 200.

The system receives an observation characterizing the current state of the environment (step 202).

The system selects an action slate that includes multiple actions by processing the observation and multiple candidate action slates using a slate Q network (step 204). Generally, each of the candidate action slates includes a different combination of multiple actions from the set of actions.

As described above, the slate Q network is a deep neural network that is configured to, for each of the candidate action slates, process the observation and the actions in the candidate action slate to generate a slate Q value for the candidate action slate that is an estimate of a long-term reward resulting from the candidate action slate being provided to the action selector in response to the observation.

Generally, the final action slate, i.e., the action slate that will be provided to the action selector, has a predetermined number of slots, with each slot being filled with a respective action from the set of actions. Each of the candidate action slates also includes the predetermined number of slots, with the slots being filled with a different combination of actions from each of the other candidate action slates.

To select the final action slate, the system divides the predetermined number of slots into subsets, with each subset being a disjoint partition of the slots in the predetermined number of slots. In some implementations, each subset has one slot. In some other implementations, some or all of the subsets have multiple slots.

The system then orders the subsets and selects the actions that will be in each subset in the final action slate subset by subset, i.e., in a sequence according to the subset ordering. Selecting the actions that will in a given subset of the slots of the final action slate is described in more detail below with reference to FIG. 3.

In some implementations, the slots in the final action slate are ordered from a highest slot in the final action slate to a lowest slot in the final action slate when provided to the action selector. In these implementations, the system orders the subsets according to the slot ordering, i.e., so that subsets that have slots that are higher in the slot ordering are higher in the subset ordering than subsets that have slots that are lower in the slot ordering.

In some other implementations, the system orders the subsets by generating a random ordering for the subsets.

The system provides the selected action slate to the action selector in response to the observation (step 206). Once the action selector has received the action slate, the action selector can select an action to interact with the environment, e.g., by selecting an action from the action slate or selecting a null action that is not included in the set of actions.

FIG. 3 is a flow diagram of an example process 300 for selecting actions for a given subset of an action slate. For convenience, the process 300 will be described as being performed by a system of one or more computers located in one or more locations. For example, a reinforcement learning system, e.g., the reinforcement learning system 100 of FIG. 1, appropriately programmed in accordance with this specification, can perform the process 300.

The system can perform the process 300 for each subset of the slots in an action slate in sequence according to the subset ordering to select actions for all of the slots of the final action slate that will be provided to the action selector.

The system generates multiple candidate action slates for the given subset of slots (step 302). In particular, each candidate action slate includes (i) in any slot for which an action has already been selected, i.e., in any slot in a subset that is before the given subset in the subset ordering, the action already selected for the slot, (ii) in each of the slots in the given subset, a respective candidate action, and (iii) in any slot other than the slots in the given subset and the slots for which an action has already been selected, a respective placeholder action. When the given subset is the last subset according to the subset ordering, there generally will not be any slots other than the slots in the given subset and the slots for which an action has already been selected, and the candidate action slates for the slot will not include any placeholder actions.

In some implementations, for each candidate action slate, the placeholder actions are selected from the candidate actions at the given subset. That is, when the given subset includes only one slot, the placeholder action at each slot other than the slots in the given subset and the slots for which an action has already been selected is the candidate action at the slot in the given subset. When the given subset includes multiple slots, the placeholder action at each slot other than the slots in the given subset and the slots for which an action has already been selected can be the same candidate action, i.e., selected randomly from the candidate actions at the slots in the given subset, or different candidate actions, i.e., each selected randomly from the candidate actions at the slots in the given subset.

In some other implementations, for each candidate action slate, the placeholder actions are predetermined, i.e., each candidate action slate has the same predetermined actions at any slots other than the slots in the given subset and the slots for which an action has already been selected can be the same candidate action.

In yet other implementations, the system receives actions suggested by an external action recommendation system and uses the received actions as the placeholder actions.

In some implementations, the system selects the candidate actions in each of the candidate action slates from the actions in the set of actions, i.e., selects each candidate action randomly from the actions in the set of actions. In some other implementations, the system receives data identifying a subset of the actions in the set of actions from an external process. If the subset of actions includes the same number of actions as there are slots in the given subset of slots, the system uses the actions in the received subset as the candidate actions. If the subset of actions includes more actions than there are slots in the given subset of slots, the system selects each candidate action, i.e., randomly, from the data identifying the subset of actions.

The system processes each candidate action slate using the slate Q network to generate a respective slate Q value for each of the candidate action slates (step 304). That is, for each of the candidate action slates, the system processes the observation and the actions in the candidate action slate using the slate Q network to generate a slate Q value for the candidate action slate.

The system selects as the actions in the given subset of slots in the action slate the candidate actions that are in the slots in the given subset in the candidate action slate having the highest slate Q value (step 306).

The system can repeat the process 300 for each subset of slots in sequence from the first subset in the subset ordering to the last subset in the subset ordering to generate the final action slate that is provided to the action selector.

Embodiments of the subject matter and the functional operations described in this specification can be implemented in digital electronic circuitry, in tangibly-embodied computer software or firmware, in computer hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions encoded on a tangible non-transitory program carrier for execution by, or to control the operation of, data processing apparatus. Alternatively or in addition, the program instructions can be encoded on an artificially-generated propagated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. The computer storage medium can be a machine-readable storage device, a machine-readable storage substrate, a random or serial access memory device, or a combination of one or more of them.

The term “data processing apparatus” refers to data processing hardware and encompasses all kinds of apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can also be or further include special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit). The apparatus can optionally include, in addition to hardware, code that creates an execution environment for computer programs, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.

A computer program (which may also be referred to or described as a program, software, a software application, a module, a software module, a script, or code) can be written in any form of programming language, including compiled or interpreted languages, or declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program may, but need not, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data, e.g., one or more scripts stored in a markup language document, in a single file dedicated to the program in question, or in multiple coordinated files, e.g., files that store one or more modules, sub-programs, or portions of code. A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this specification can be performed by one or more programmable computers executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).

Computers suitable for the execution of a computer program include, by way of example, can be based on general or special purpose microprocessors or both, or any other kind of central processing unit. Generally, a central processing unit will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a central processing unit for performing or executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. However, a computer need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a Global Positioning System (GPS) receiver, or a portable storage device, e.g., a universal serial bus (USB) flash drive, to name just a few.

Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

To provide for interaction with a user, embodiments of the subject matter described in this specification can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input. In addition, a computer can interact with a user by sending documents to and receiving documents from a device that is used by the user; for example, by sending web pages to a web browser on a user's client device in response to requests received from the web browser.

Embodiments of the subject matter described in this specification can be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computer having a relationship graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (“WAN”), e.g., the Internet.

The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular inventions. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system modules and components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

Particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. For example, the actions recited in the claims can be performed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous. 

What is claimed is: 1-20. (canceled)
 21. A method of providing a slate of actions to an action selector that interacts with an environment by selecting and performing actions, wherein the slate of actions includes a plurality of actions selected from a predetermined set of actions, and wherein the environment transitions states in response to actions performed by the action selector, the method comprising: receiving an observation characterizing a current state of the environment; generating a plurality of candidate action slates that each comprise a plurality of actions from the predetermined set of actions, wherein each candidate action slate has a same, predetermined number of slots with each slot being filled with a respective action from the predetermined set of actions, and wherein, for each candidate action slate, the slots are filled with a different combination of actions from each of other candidate action slates; for each candidate action slate, processing the candidate action slate using a deep neural network, wherein, for each candidate action slate, the deep neural network: receives an input that comprises the plurality of actions in the candidate action slate and the observation, and generates, as output, a slate Q value for the candidate action slate that is an estimate of a long-term reward resulting from the candidate action slate being provided to the action selector in response to the observation; selecting an action slate from the plurality of candidate action slates based on the slate Q values generated as output by the deep neural network for the candidate action slates; and providing the selected action slate to the action selector in response to the observation.
 22. The method of claim 21, wherein, in response to receiving the action slate, the action selector performs either (i) an action selected from the action slate or (ii) a null action that is not included in the predetermined set of actions.
 23. The method of claim 21, wherein generating the plurality of candidate action slates comprises, for a given subset of the slots in the candidate action slate: generating a plurality of candidate slates for the given subset of slots, each candidate slate for the given subset of slots including: in any slot for which an action has already been selected, the action already selected for the slot, a respective candidate action in each of the slots in the given subset, and a respective placeholder action in any slot in the action slate other than the slots in the given subset and the slots for which an action has already been selected; and wherein selecting the action slate comprises selecting as the actions in the given subset of slots in the action slate the candidate actions that are in the slots in the given subset in the candidate slate having a highest slate Q value.
 24. The method of claim 23, wherein the given subset of slots has a predetermined number of slots that is greater than one.
 25. The method of claim 23, wherein the given subset of slots has one slot.
 26. The method of claim 23, wherein the slots in the action slate are ordered from a highest slot in the action slate to a lowest slot in the action slate when provided to the action selector, and wherein selecting the action slate comprises selecting an action for each subset of slots in the action slate in sequence based on an ordering of the slots in the action slate when provided to the action selector.
 27. The method of claim 23, further comprising: generating a random ordering of subsets of slots in the action slate, wherein selecting an action slate comprises selecting an action for each subset of slots in the action slate in sequence according to the random ordering.
 28. The method of claim 23, wherein, for each candidate action slate, the placeholder action is the same as one of the candidate actions in the given subset.
 29. The method of claim 23, wherein, for each candidate action slate, the placeholder actions are actions suggested by another action recommendation system.
 30. The method of claim 21, wherein the actions in each candidate action slate are selected from a subset of the actions in the predetermined set of actions generated by another process.
 31. The method of claim 21, further comprising: receiving a reward in response to providing the action slate to the action selector; and using the reward in updating values of parameters of the deep neural network.
 32. The method of claim 31, wherein using the reward in updating the values of the parameters of the deep neural network comprises: receiving a next observation characterizing a next state of the environment; and using a current observation, the selected action slate, the reward, and the next observation to update the values of the parameters of the deep neural network.
 33. The method of claim 32, wherein using the current observation, the selected action slate, the reward, and the next observation to update the values of the parameters of the deep neural network comprises: modifying the reward to generate a modified reward; and using the modified reward in place of the reward in updating the values.
 34. The method of claim 33, wherein the modified reward satisfies r{circumflex over ( )}a, wherein r is the reward and a is a constant value greater than one.
 35. The method of claim 21, wherein the environment is a content item presentation setting provided by a content item recommendation system, wherein the action selector is a user of the content item recommendation system, wherein the actions in the predetermined set of actions are recommendations of content items, and wherein each action in the action slate is a recommendation of a distinct action to the user of the content item recommendation system.
 36. The method of claim 21, wherein the observation characterizing the current state includes data characterizing a preceding action that was selected by the action selector from a preceding slate of actions provided to the action selector in response to a preceding observation.
 37. A system comprising one or more computers and one or more storage devices storing instructions that, when executed by the one or more computers, cause the one or more computers to perform operations for providing a slate of actions to an action selector that interacts with an environment by selecting and performing actions, wherein the slate of actions includes a plurality of actions selected from a predetermined set of actions, and wherein the environment transitions states in response to actions performed by the action selector, the operations comprising: receiving an observation characterizing a current state of the environment; generating a plurality of candidate action slates that each comprise a plurality of actions from the predetermined set of actions, wherein each candidate action slate has a same, predetermined number of slots with each slot being filled with a respective action from the predetermined set of actions, and wherein, for each candidate action slate, the slots are filled with a different combination of actions from each of other candidate action slates; for each candidate action slate, processing the candidate action slate using a deep neural network, wherein, for each candidate action slate, the deep neural network: receives an input that comprises the plurality of actions in the candidate action slate and the observation, and generates, as output, a slate Q value for the candidate action slate that is an estimate of a long-term reward resulting from the candidate action slate being provided to the action selector in response to the observation; selecting an action slate from the plurality of candidate action slates based on the slate Q values generated as output by the deep neural network for the candidate action slates; and providing the selected action slate to the action selector in response to the observation.
 38. The system of claim 37, wherein, in response to receiving the action slate, the action selector performs either (i) an action selected from the action slate or (ii) a null action that is not included in the predetermined set of actions.
 39. The system of claim 37, wherein generating the plurality of candidate action slates comprises, for a given subset of the slots in the candidate action slate: generating a plurality of candidate slates for the given subset of slots, each candidate slate for the given subset of slots including: in any slot for which an action has already been selected, the action already selected for the slot, a respective candidate action in each of the slots in the given subset, and a respective placeholder action in any slot in the action slate other than the slots in the given subset and the slots for which an action has already been selected; and wherein selecting the action slate comprises selecting as the actions in the given subset of slots in the action slate the candidate actions that are in the slots in the given subset in the candidate slate having a highest slate Q value.
 40. One or more non-transitory computer storage media encoded with instructions that, when executed by one or more computers, cause the one or more computers to perform operations for providing a slate of actions to an action selector that interacts with an environment by selecting and performing actions, wherein the slate of actions includes a plurality of actions selected from a predetermined set of actions, and wherein the environment transitions states in response to actions performed by the action selector, the operations comprising: receiving an observation characterizing a current state of the environment; generating a plurality of candidate action slates that each comprise a plurality of actions from the predetermined set of actions, wherein each candidate action slate has a same, predetermined number of slots with each slot being filled with a respective action from the predetermined set of actions, and wherein, for each candidate action slate, the slots are filled with a different combination of actions from each of other candidate action slates; for each candidate action slate, processing the candidate action slate using a deep neural network, wherein, for each candidate action slate, the deep neural network: receives an input that comprises the plurality of actions in the candidate action slate and the observation, and generates, as output, a slate Q value for the candidate action slate that is an estimate of a long-term reward resulting from the candidate action slate being provided to the action selector in response to the observation; selecting an action slate from the plurality of candidate action slates based on the slate Q values generated as output by the deep neural network for the candidate action slates; and providing the selected action slate to the action selector in response to the observation. 